Directed Polymers on Infinite Graphs
نویسندگان
چکیده
We study the directed polymer model for general graphs (beyond $${\mathbb {Z}}^d$$ ) and random walks. provide sufficient conditions existence or non-existence of a weak disorder phase, an $$L^2$$ region, very strong disorder, in terms properties graph walk. some detail (biased) walk on various trees including Galton–Watson trees, range other examples that illustrate counter-examples to intuitive extensions /SRW result.
منابع مشابه
Infinite primitive directed graphs
A group G of permutations of a set is primitive if it acts transitively on , and the only G-invariant equivalence relations on are the trivial and universal relations. A digraph is primitive if its automorphism group acts primitively on its vertex set, and is infinite if its vertex set is infinite. It has connectivity one if it is connected and there exists a vertex α of , such that the induced...
متن کامل6 Infinite Primitive Directed Graphs
A group G of permutations of a set Ω is primitive if it acts transitively on Ω, and the only G-invariant equivalence relations on Ω are the trivial and universal relations. A graph Γ is primitive if its automorphism group acts primitively on its vertex set. A graph Γ has connectivity one if it is connected and there exists a vertex α of Γ, such that the induced graph Γ \ {α} is not connected. I...
متن کاملOn Infinite-finite Duality Pairs of Directed Graphs
The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems to be very complex. It is also known that no finite-infinite duality pair is possible if we make the additional restriction that both classes are antichains. ...
متن کاملIndependent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملMatchings on infinite graphs
We prove that the local weak convergence of a sequence of graphs is enough to guarantee the convergence of their normalized matching numbers. The limiting quantity is described by a local recursion defined on the weak limit of the graph sequence. However, this recursion may admit several solutions, implying non-trivial long-range dependencies between the edges of a largest matching. We overcome...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2021
ISSN: ['0010-3616', '1432-0916']
DOI: https://doi.org/10.1007/s00220-021-04034-w